Simple Fractions and Linear Decomposition of Some Convolutions of Measures
نویسندگان
چکیده
Every characteristic function φ can be written in the following way: φ(ξ) = 1 h(ξ) + 1 , where h(ξ) = { 1/φ(ξ)− 1 if φ(ξ) 6= 0 ∞ if φ(ξ) = 0. This simple remark implies that every characteristic function can be treated as a simple fraction of the function h(ξ). In the paper, we consider a class C(φ) of all characteristic functions of the form φa(ξ) = a h(ξ)+a , where φ(ξ) is a fixed characteristic function. Using the well known theorem on simple fraction decomposition of rational functions we obtain that convolutions of measures μa with μ̂a(ξ) = φa(ξ) are linear combinations of powers of such measures. This can simplify calculations. It is interesting that this simplification uses signed measures since coefficients of linear combinations can be negative numbers. All the results of this paper except Proposition 1 remain true if we replace probability measures with complex valued measures with finite variation, and replace the characteristic function with Fourier transform.
منابع مشابه
Partial-Fraction Decomposition Approach to the M/H2/2 Queue
Here, a two server queueing system with Poisson arrivals and two different types of customers (M/H2/2 queue) is analyzed. A novel straightforward method is presented to acquire the exact and explicit forms of the performance measures. First, the steady state equations along with their Z-transforms are derived for the aforementioned queueing system. Using some limiting behaviors of the steady-st...
متن کاملConvolutions of long-tailed and subexponential distributions
We study convolutions of long-tailed and subexponential distributions (probability measures), and more general finite measures, on the real line. Our aim is to prove some important new results, and to do so through a simple, coherent and systematic approach. It turns out that all the standard properties of such convolutions are then obtained as easy consequences of these results. Thus we also h...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملSsT decomposition method for solving fully fuzzy linear systems
The SST decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. In this topic we are going to consider vectors as fuzzy vectors. We have considered a numerical example and tried to find out solution vector x in fuzzified form using method of SST decomposition.
متن کاملNumerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
متن کامل